3 research outputs found
Exact Sampling of Stationary and Time-Reversed Queues
We provide the first algorithm that under minimal assumptions allows to
simulate the stationary waiting-time sequence of a single-server queue
backwards in time, jointly with the input processes of the queue (inter-arrival
and service times). The single-server queue is useful in applications of DCFTP
(Dominated Coupling From The Past), which is a well known protocol for
simulation without bias from steady-state distributions. Our algorithm
terminates in finite time assuming only finite mean of the inter-arrival and
service times. In order to simulate the single-server queue in stationarity
until the first idle period in finite expected termination time we require the
existence of finite variance. This requirement is also necessary for such idle
time (which is a natural coalescence time in DCFTP applications) to have finite
mean. Thus, in this sense, our algorithm is applicable under minimal
assumptions.Comment: 30 pages, 3 figures, Journa
Recommended from our members
Perfect Simulation and Deployment Strategies for Detection
This dissertation contains two parts. The first part provides the first algorithm that, under minimal assumptions, allows to simulate the stationary waiting-time sequence of a single-server queue backwards in time, jointly with the input processes of the queue
(inter-arrival and service times).
The single-server queue is useful in applications of DCFTP (Dominated Coupling From The Past), which is a well known protocol for simulation without bias from steady-state distributions. Our algorithm terminates in finite time assuming only finite mean of the
inter-arrival and service times. In order to simulate the single-server queue in stationarity until the first idle period in finite expected termination time we require the existence of finite variance. This requirement is also necessary for such idle time (which is a natural
coalescence time in DCFTP applications) to have finite mean. Thus, in this sense, our algorithm is applicable under minimal assumptions.
The second part studies the behavior of diffusion processes in a random environment.
We consider an adversary that moves in a given domain and our goal is to produce an optimal strategy to detect and neutralize him by a given deadline. We assume that the target's dynamics follows a diffusion process whose parameters are informed by available intelligence information. We will dedicate one chapter to the rigorous formulation of the detection problem, an introduction of several frameworks that can be considered when applying our methods, and a discussion on the challenges of finding the analytical optimal solution. Then, in the following chapter, we will present our main result, a large deviation behavior of the adversary's survival probability under a given strategy. This result will be later give rise to asymptotically efficient Monte Carlo algorithms
Networking low-power energy harvesting devices: Measurements and algorithms
Abstract—Recent advances in energy harvesting materials and ultra-low-power communications will soon enable the realization of networks composed of energy harvesting devices. These devices will operate using very low ambient energy, such as indoor light energy. We focus on characterizing the energy availability in indoor environments and on developing energy allocation algorithms for energy harvesting devices. First, we present results of our long-term indoor radiant energy measurements, which provide important inputs required for algorithm and system design (e.g., determining the required battery sizes). Then, we focus on algorithm development, which requires nontraditional approaches, since energy harvesting shifts the nature of energy-aware protocols from minimizing energy expenditure to optimizing it. Moreover, in many cases, different energy storage types (rechargeable battery and a capacitor) require different algorithms. We develop algorithms for determining time fair energy allocation in systems with predictable energy inputs, as well as in systems where energy inputs are stochastic. Index Terms—Energy harvesting, ultra-low-power networking, indoor radiant energy, measurements, energy-aware algorithms. I